Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts
نویسنده
چکیده
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner rectangular drawing has some applications to VLSI layouts. In this talk we show that a plane graph G has an inner rectangular drawing D if and only if a new bipartite graph constructed from G has a perfect matching. We also show that D can be found in time O(n/ log n) if G has n vertices and a sketch of the outer face is prescribed, that is, all the convex outer vertices and concave ones are prescribed. This is a joint work with K. Miura and H. Haga. Biography of Takao Nishizeki Professor Takao Nishizeki, currently Vice Dean and Professor of algorithm theory in the Graduate School of Information Sciences, Tohoku University in Japan, was born in Fukushima, northeastern part of Japan, in 1947. He received the B. E., M. E. and D. E. degrees in electrical communication engineering from Tohoku University, one of the most prominent universities in Japan, in 1969, 1971 and 1974, respectively. Upon graduation, he joined the faculty at Tohoku University, where in 1988 he was appointed to the current professorship. Professor Nishizeki has established himself, both nationally and internationally, as a world leader in the computer science, in particular, algorithms for planar graphs, edge-coloring, network flows, VLSI routing, graph drawing and cryptology. His publication list includes three co-authored books, five edited books and more than two hundred technical papers in leading journals and prestigious conferences such as JACM, Algorithmica, Journal of Algorithms, STOC, ICALP, and SODA. The quality of his work is best illustrated by the fact that a number of his papers have been selected as best papers and have also been invited to special journal issues. One of his co-authored books, “Planar Graph Drawing” published in 2004, was written with a promising computer scientist of Bangladesh, Dr. Md. Saidur Rahman who received Master of Information Sciences and Ph. D. degrees under Professor Nishizeki’s supervision and is now a professor of BUET. The book is considered as the most valuable pioneering work of planar graph drawings, and it has been widely distributed over the world. M. Kaykobad and Md. Saidur Rahman (Eds.): WALCOM 2007, pp. 1–2, 2007.
منابع مشابه
Efficient Algorithms for Drawing Planar Graphs
This thesis presents efficient algorithms for drawing planar graphs. Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. In this thesis we study rectangular drawings, orthogonal drawings, convex drawings and our newly defined box-rectangular drawings. Rectangular drawings and box-rec...
متن کاملComplexity of Finding Non-Planar Rectilinear Drawings of Graphs
Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout Methods p. 80 Orthogonal Graph Drawing with ...
متن کاملInner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. In this paper we show that a plane graph G has an inner rectangular drawing D if and only if a new bipartite graph constructed from G has a perfect matching. We also show that D can be found in time O(n/ logn) if G has n verti...
متن کاملA Compact Encoding of Rectangular Drawings with Edge Lengths
A rectangular drawing is a plane drawing of a graph in which every face is a rectangle. Rectangular drawings have an application for floorplans, which may have a huge number of faces, so compact code to store the drawings is desired. The most compact code for rectangular drawings needs at most 4 f − 4 bits, where f is the number of inner faces of the drawing. The code stores only the graph stru...
متن کاملAlgorithms for Drawing Plane Graphs
Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007